Rich-club and page-club coefficients for directed graphs

نویسندگان

  • Daniel Smilkov
  • Ljupco Kocarev
چکیده

Rich-club and page-club coefficients and their null models are introduced for directed graphs. Null models allow for a quantitative discussion of the rich-club and page-club phenomena. These coefficients are computed for four directed real-world networks: Arxiv High Energy Physics paper citation network, Web network (released from Google), Citation network among US Patents, and Email network from a EU research institution. The results show a high correlation between rich-club and page-club ordering. For journal paper citation network, we identify both rich-club and page-club ordering, showing that “elite” papers are cited by other “elite” papers. Google web network shows partial rich-club and page-club ordering up to some point and then a narrow declining of the corresponding normalized coefficients, indicating the lack of rich-club ordering and the lack of page-club ordering, i.e. high in-degree (PageRank) pages purposely avoid sharing links with other high in-degree (PageRank) pages. For UC patents citation network, we identify page-club and rich-club ordering providing a conclusion that “elite” patents are cited by other “elite” patents. Finally, for e-mail communication network we show lack of both rich-club and page-club ordering. We construct an example of synthetic network showing page-club ordering and the lack of rich-club ordering.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Revisiting the Rich Club of the Internet AS-Level Topology

We evaluate the rich-club property of the Internet topology at the autonomous system (AS) level by comparing the Internet AS graphs of traceroute and BGP, and the synthetic graphs of PFP model. The results indicate that, for rich-club coefficient, PFP model can exactly match traceroute AS graphs in the early years around 2002, but it has significantly deviated from the grown AS graphs since abo...

متن کامل

Generalized Rich-Club Ordering in Networks

Abstract Rich-club ordering refers to tendency of nodes with a high degree to be more interconnected than expected. In this paper we consider the concept of rich-club ordering when generalized to structural measures different from the node degree and to non-structural measures (i.e. to node metadata). The differences in considering rich-club ordering (RCO) with respect to both structural and no...

متن کامل

Task-related effective connectivity reveals that the cortical rich club gates cortex-wide communication.

Higher cognition may require the globally coordinated integration of specialized brain regions into functional networks. A collection of structural cortical hubs-referred to as the rich club-has been hypothesized to support task-specific functional integration. In the present paper, we use a whole-cortex model to estimate directed interactions between 68 cortical regions from functional magneti...

متن کامل

Rich-club connectivity dominates assortativity and transitivity of complex networks

Rich-club, assortativity and clustering coefficients are frequently used measures to estimate topological properties of complex networks. Here we find that the connectivity among a very small portion of the richest nodes can dominate the assortativity and clustering coefficients of a large network, which reveals that the rich-club connectivity is leveraged throughout the network. Our study sugg...

متن کامل

Ensembles related to the rich-club coefficient for non-evolving networks

In networks the rich nodes are the subset of nodes with large numbers of links, or high degrees. The rich nodes and the connectivity between themselves (rich–club connectivity) tend to dominate the organisation of network structure. Recently there has been a considerable effort to characterise and model the rich–club connectivity in a variety of complex networks. In this paper we firstly clarif...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1103.2264  شماره 

صفحات  -

تاریخ انتشار 2011